Curvature and Geodesics, Discrete Laplacian and related smoothing methods
نویسنده
چکیده
Mesh smoothing is a method to remove noise or small scale features from large meshes, while still preserving the basic overall shape and important features of the original model. Most sophisticated smoothing methods rely on ideas from differential geometry. In this lecture we discuss some basic geometric concepts and introduce some simple smoothing algorithms; the paper presented at this lecture describes more sophisticated algorithms which make use of discrete approximations of differential geometric quantities.
منابع مشابه
Symmetric curvature tensor
Recently, we have used the symmetric bracket of vector fields, and developed the notion of the symmetric derivation. Using this machinery, we have defined the concept of symmetric curvature. This concept is natural and is related to the notions divergence and Laplacian of vector fields. This concept is also related to the derivations on the algebra of symmetric forms which has been discu...
متن کاملMesh Smoothing via Mean and Median Filtering Applied to Face Normals
In this paper, we introduce iterative mean and median filtering schemes for smoothing noisy 3D shapes given as triangle meshes. Our main idea consists of applying mean and median filtering schemes to mesh normals and then update the mesh vertex position in order to fit the mesh to the modified normals. We also give a quantitative evaluation of the proposed mesh filtering schemes and compare the...
متن کاملAnisotropic smoothing of point sets,
The use of point sets instead of meshes became more popular during the last years. We present a new method for anisotropic fairing of a point sampled surface using an anisotropic geometric mean curvature ßow. The main advantage of our approach is that the evolution removes noise from a point set while it detects and enhances geometric features of the surface such as edges and corners. We derive...
متن کاملNumerical Computation of Discrete Differential Operators on Non-Uniform Grids
In this paper, we explore the numerical approximation of discrete differential operators on nonuniform grids. The Voronoi cell and the notion of natural neighbors are used to approximate the Laplacian and the gradient operator on irregular grids. The underlying weight measure used in the numerical computations is the Laplace weight function, which has been previously adopted in meshless Galerki...
متن کاملTechnical Report: Using Laplacian Methods, RKHS Smoothing Splines and Bayesian Estimation as a framework for Regression on Graph and Graph Related Domains
1 Laplacian Methods: An Overview 2 1.1 De nition: The Laplacian operator of a Graph . . . . . . . . . . 2 1.2 Properties of the Laplacian and its Spectrum . . . . . . . . . . . 4 1.2.1 Spectrum of L and e L: Graph eigenvalues and eigenvectors: 4 1.2.2 Other interesting / useful properties of the normalized Laplacian (Chung): . . . . . . . . . . . . . . . . . . . . . 6 1.2.3 Laplacians of Weight...
متن کامل